Efficient eigen-updating for spectral graph clustering
نویسندگان
چکیده
منابع مشابه
Efficient eigen-updating for spectral graph clustering
Partitioning a graph into groups of vertices such that those within each group are more densely connected than vertices assigned to different groups, known as graph clustering, is often used to gain insight into the organisation of large scale networks and for visualisation purposes. Whereas a large number of dedicated techniques have been recently proposed for static graphs, the design of onli...
متن کاملIncremental spectral clustering by efficiently updating the eigen-system
Article history: Received 20 November 2008 Received in revised form 31 May 2009 Accepted 5 June 2009
متن کاملSpectral Graph Clustering
Spectral clustering is a powerful technique in data analysis that has found increasing support and application in many areas. This report is geared to give an introduction to its methods, presenting the most common algorithms, discussing advantages and disadvantages of each, rather than endorsing one of them as the best, because, arguably, there is no black-box algorithm, which performs equally...
متن کاملExploratory Item Classification Via Spectral Graph Clustering
Large-scale assessments are supported by a large item pool. An important task in test development is to assign items into scales that measure different characteristics of individuals, and a popular approach is cluster analysis of items. Classical methods in cluster analysis, such as the hierarchical clustering, K-means method, and latent-class analysis, often induce a high computational overhea...
متن کاملGraph matching and clustering using spectral partitions
Although inexact graph-matching is a problem of potentially exponential complexity, the problem may be simplified by decomposing the graphs to be matched into smaller subgraphs. If this is done, then the process may cast into a hierarchical framework and hence rendered suitable for parallel computation. In this paper we describe a spectral method which can be used to partition graphs into nonov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neurocomputing
سال: 2014
ISSN: 0925-2312
DOI: 10.1016/j.neucom.2013.11.015